Exploiting Hub States in Automatic Verification
نویسندگان
چکیده
In this paper we present a new algorithm to counteract state explosion when using Explicit State Space Exploration to verify protocollike systems. We sketch the implementation of our algorithm within the Caching Murφ verifier and give experimental results showing its effectiveness. We show experimentally that, when memory is a scarce resource, our algorithm improves on the time performances of Caching Murφ verification algorithm, saving between 16% and 68% (45% on average) in computation time.
منابع مشابه
A Hybrid Meta-heuristic Approach to Cope with State Space Explosion in Model Checking Technique for Deadlock Freeness
Model checking is an automatic technique for software verification through which all reachable states are generated from an initial state to finding errors and desirable patterns. In the model checking approach, the behavior and structure of system should be modeled. Graph transformation system is a graphical formal modeling language to specify and model the system. However, modeling of large s...
متن کاملExploiting Transition Locality in the Disk Based Murφ Verifier
The main obstruction to automatic verification of Finite State Systems is the huge amount of memory required to complete the verification task (state explosion). This motivates research on distributed as well as disk based verification algorithms. In this paper we present a disk based Breadth First Explicit State Space Exploration algorithm as well as an implementation of it within the Murφ ver...
متن کاملAutomatic verification of broadcast news transcriptions
In this paper we present a method for automatically detecting erroneous training scripts for speech corpora like Broadcast News and Switchboard. Based on the Hub-4 task we will report on the performance of error detection with the proposed method and investigate the effects of both manually and automatically cleaned training corpora on the performance of the RWTH speech recognition system. Our ...
متن کاملSuperscalar Processor Verification Using Efficient Reductions of the Logic of Equality with Uninterpreted Functions to Propositional Logic 1
We present a collection of ideas that allows the pipeline verification method pioneered by Burch and Dill [5] to scale very efficiently to dual-issue superscalar processors. We achieve a significant speedup in the verification of such processors, compared to the result by Burch [6], while using an entirely automatic tool. Instrumental to our success are exploiting the properties of positive equ...
متن کاملImprovement of the Reliability of Automatic Manufacture Systems by Using FTA Technique
In recent years, Many manufacturing industries for promoting their efficiency have tended to use the automatic manufacturing systems. Expanding automatic systems and to increase their complexity are representing the necessity of studying a proper functional quality and using reliable equipment in such systems more than ever. In this direction, the technique of fault tree analysis (FTA), along w...
متن کامل